A new parallel binary image shrinking algorithm
نویسندگان
چکیده
A new parallel binary image shrinking algorithm that can be considered as an improvement of Levialdi's (1972) parallel shrinking algorithm and can be used in many image labeling algorithms as a basic operation in order to reduce the storage requirements for local memory and speed up the labeling process is presented. This new parallel shrinking algorithm shrinks an nxn binary image to an image with no black pixels in O(n) parallel steps with a multiplicative constant of 1.5, preserving the 8-connectivity in the shrinking process.
منابع مشابه
Reconfigurable Mesh Algorithms for Image Shrinking, Expanding, Clustering, and Template Matching
Parallel reconfigurable mesh algorithms are developed for the following image processing problems: shrinking, expanding, clustering, and template matching. Our N×N reconfigurable mesh algorithm for the q-step shrinking and expansion of a binary image takes O (1) time. One pass of the clustering algorithm for N patterns and K centers can be done in O (MK + KlogN), O (KlogNM ), and O (M + logNMK ...
متن کاملImage Shrinking and Expanding on a Pyramid
We develop two algorithms to perform the q step shrinking and expanding of an N×N binary image on a pyramid computer with an N×N base. The time complexity of both algorithms is O(√ q ). However, one uses O(√ q ) space per processor while the per processor space requirement of the other is O (1).
متن کاملDPML-Risk: An Efficient Algorithm for Image Registration
Targets and objects registration and tracking in a sequence of images play an important role in various areas. One of the methods in image registration is feature-based algorithm which is accomplished in two steps. The first step includes finding features of sensed and reference images. In this step, a scale space is used to reduce the sensitivity of detected features to the scale changes. Afterw...
متن کاملA Thinning Algorithm for Digital Figures of Characters
A thinning scheme could be used as an useful pre processing in image processing. Various algorithms have been proposed to produce the skeleton of digital binary pattern. However, they have undesirable properties that tend to cause shrinking or vanishing of the segment, the appearance of a beard, and warping where segments intersect. In this paper, we propose a parallel Hilditch algorithm to acq...
متن کامل2D Parallel Thinning and Shrinking Based on Sufficient Conditions for Topology Preservation
Thinning and shrinking algorithms, respectively, are capable of extracting medial lines and topological kernels from digital binary objects in a topology preserving way. These topological algorithms are composed of reduction operations: object points that satisfy some topological and geometrical constraints are removed until stability is reached. In this work we present some new sufficient cond...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
دوره 4 2 شماره
صفحات -
تاریخ انتشار 1995